Displaying Random Surfaces

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Surfaces

We study the statistical physical properties of (discretized) “random surfaces,” which are random functions from Z (or large subsets of Z) to E, where E is Z or R. Their laws are determined by convex, nearest-neighbor, gradient Gibbs potentials that are invariant under translation by a full-rank sublattice L of Z; they include many discrete and continuous height function models (e.g., domino ti...

متن کامل

Two Simple Algorithms for Displaying Orthographic Projections of Surfaces

Two simple algorithms are described for displaying orthographic projections of surfaces. The first, called RELIEF-PLOT, produces a three-dimensional plot of a surface z = f(x,y). The second, called SHADED-IMAGE, adds information about surface reflectivity and source illumination to produce a grey level image of a surface z f(x,y). Both algorithms demonstrate how a systematic profile expansion c...

متن کامل

An analytical visibility method for displaying parametrically defined surfaces

This paper describes an analytical method to determine the visible parts of a Cartesian product surface. The bounds of these visible areas are determined in terms of the (u,v)-parameter-plane. This leads to many advantages over approximating algorithms. The new method allows the calculation and display of only the boundaries and contour curves with high precision. It calculates the critical poi...

متن کامل

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, ...

متن کامل

Self Avoiding Random Surfaces

Self avoiding random surfaces on a cubic lattice are studied by extensive Monte Carlo sampling The surfaces have empty boundary and the topology of a sphere An oct tree data structure allows to obtain good statistics for surfaces whose plaquette number is almost an order of magnitude greater than in previous investigations Maximum likelihood determinations of the critical plaquette fugacity and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1987

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/30.2.163